102 research outputs found

    Preface

    Get PDF
    19451945 (N19)

    REMREC - A program for Automatic Recursion Removal

    No full text
    It is well known that recursive functions are very common in LISP. Recursive code is mostly the easiest to write and to analyse. However, situations often arise when it is preferable to let the computer work with non recursive functions. Examples of this are in compiled code and on stack overflow. It is then very often possible to remove recursion (at least partly) in the functions, without therefore introducing stacks in the new code. Remrec is a program, which automatically transfers some classes of recursive LISP functions into equivalent non recursive ones, without introducing stacks

    REMREC - A program for Automatic Recursion Removal

    No full text
    It is well known that recursive functions are very common in LISP. Recursive code is mostly the easiest to write and to analyse. However, situations often arise when it is preferable to let the computer work with non recursive functions. Examples of this are in compiled code and on stack overflow. It is then very often possible to remove recursion (at least partly) in the functions, without therefore introducing stacks in the new code. Remrec is a program, which automatically transfers some classes of recursive LISP functions into equivalent non recursive ones, without introducing stacks
    • …
    corecore